Diploma Thesis

نویسنده

  • Philipp Glaser
چکیده

Cyclists often have multiple criteria in mind when planning a route. They do not only consider the length of the route, but also the (perceived) safety or the environment of the route. Cycleways through park are often more attractive than heavily used roads. But not every cyclist weights these criteria the same way and even for one cyclist the weighting may depend on his current situation. In a hurry travel time might be the most important aspect, but even then memight make consider howmuch he will compromise his safety. In particular he will likely accept a slightly longer travel time, if the alternate route is perceived as much safer. Another often regarded criterion is the elevation difference of the route. We consider this five criteria in our approach. As basis for our algorithm we use A* search. To get suitable potentials we use a reverse Dijkstra search starting a the target node for each criterion. The big drawback of performing a multi-criteria search is that the number of routes may grow very quickly, which leads to a long query time as well as to a route set that does not help the user much in his rotue planning. Therefore we filter the routes during the computation to get a small amount of routes to help the user. To do this we use a variation of Pareto-dominance, in which a route are discarded if they would be dominated assuming it would be worse by an ε. Using this heuristic the number of found routes can be reduced by an significant amount and therefore the running time is reduced accordingly. AS a minor drawback the set of routes found with this approach depends on the order in which the routes are found. Therefore we tested and compared several difference order, which we used for our search. Out of the evaluated orderings the Euclidean distance to the potential of the source node resulted in the fewest routes, if we keep the same ε. Compared to the lexicographic order this resulted in 57 % fewer routes on average on a small graph. On a big graph it even reduced the number of routes by 90 %.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unequal Error Protection Turbo Codes Diploma Thesis

I affirm that I wrote the Diploma Thesis by my self and that I did not use other than the indicated sources and resources.

متن کامل

Automatic Lexical Acquisition for German Based on Morphological Paradigms Diploma Thesis Proposal

The general aim of my diploma thesis is to develop a (semi-)automatic method for the acquisition of a German inflectional lexicon from raw texts. In particular, I want to explore whether inflectional stems can be deduced from word-form occurences that fit into known morphological paradigm classes.

متن کامل

Master Thesis

Acknowledgements I thank my supervisor, Doc. RNDr. Roman Barták, Ph.D., for his patient guidance and for his critical comments that helped me make this thesis better. I thank my parents for their continuous support through the work on this thesis and through all my studies. I hereby declare that I have written this diploma thesis on my own and solely with the use of cited references. I agree wi...

متن کامل

Analysis of UML Workflow diagrams with Dynamic Meta Modeling techniques Diploma Thesis

This thesis is dedicated to my family. Thanks for always supporting me, no matter which way I chose.. .

متن کامل

Evolving Code Clones

The goal of this project plan is to give an short overview of the topic that lies beneath the diploma thesis. It describes the main tasks and outcomes that should be achieved during this thesis. Since time management is an essential part of writing a diploma thesis, this plan also serves a guideline helping not to loose control over the allocated time. The thesis consists of 5 tasks (See [1] fo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015